Characterizing Block Graphs in Terms of their Vertex-Induced Partitions

Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that $1.$ the (necessarily unique) smallest block graph with vertex set $V$ whose edge set contains $E$ is uniquely determined by the $V$-indexed family ${\bf P}_G:=\big(\pi_0(G^{(v)})\big)_{v \in V}$ of the various partitions $\pi_0(G^{(v)})$ of the set $V$ into the set of connected components of the graph $G^{(v)}:=(V,\{e\in E: v\notin e\})$, $2.$ the edge set of this block graph coincides with set of all $2$-subsets $\{u,v\}$ of $V$ for which $u$ and $v$ are, for all $w\in V-\{u,v\}$, contained in the same connected component of $G^{(w)}$, $3.$ and an arbitrary $V$-indexed family ${\bf P}p=({\bf p}_v)_{v \in V}$ of partitions $\pi_v$ of the set $V$ is of the form ${\bf P}p={\bf P}p_G$ for some connected simple graph $G=(V,E)$ with vertex set $V$ as above if and only if, for any two distinct elements $u,v\in V$, the union of the set in ${\bf p}_v$ that contains $u$ and the set in ${\bf p}_u$ that contains $v$ coincides with the set $V$, and $\{v\}\in {\bf p}_v$ holds for all $v \in V$. As well as being of inherent interest to the theory of block graphs, these facts are also useful in the analysis of compatible decompositions and block realizations of finite metric spaces

funcX: A Federated Function Serving Fabric for Science

Exploding data volumes and velocities, new computational methods and platforms, and ubiquitous connectivity demand new approaches to computation in the sciences. These new approaches must enable computation to be mobile, so that, for example, it can occur near data, be triggered by events (e.g., arrival of new data), be offloaded to specialized accelerators, or run remotely where resources are available. They also require new design approaches in which monolithic applications can be decomposed into smaller components, that may in turn be executed separately and on the most suitable resources. To address these needs we present funcX---a distributed function as a service (FaaS) platform that enables flexible, scalable, and high performance remote function execution. funcX's endpoint software can transform existing clouds, clusters, and supercomputers into function serving systems, while funcX's cloud-hosted service provides transparent, secure, and reliable function execution across a federated ecosystem of endpoints. We motivate the need for funcX with several scientific case studies, present our prototype design and implementation, show optimizations that deliver throughput in excess of 1 million functions per second, and demonstrate, via experiments on two supercomputers, that funcX can scale to more than more than 130000 concurrent workers.Comment: Accepted to ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC 2020). arXiv admin note: substantial text overlap with arXiv:1908.0490

A MAPE-K Approach to Autonomic Microservices

Microservices are an emerging architectural style advocating for small loosely-coupled services in order to maximize scalability and adaptability. In order to help IT personnel, adaptability can be put (completely or partially) under the responsibility of the system using autonomic techniques, e.g., underpinned by a MAPE-K control loop. This paper discusses possible trade-offs, challenges and support techniques for soft-ware architects involved in building autonomic microservice-based systems

Narrativizing Knowledge Graphs

Any natural language expression of a set of facts - that can be represented as a knowledge graph - will more or less overtly assume a specific perspective on these facts. In this paper we see the conversion of a given knowledge graph into natural language as the construction of a narrative about the assertions made by the knowledge graph. We, therefore, propose a specific pipeline that can be applied to produce linguistic narratives from knowledge graphs using an ontological layer and corresponding rules that turn a knowledge graph into a semantic specification for natural language generation. Critically, narratives are seen as necessarily committing to specific perspectives taken on the facts presented. We show how this most commonly neglected facet of producing summaries of facts can be brought under control

On a Linear Program for Minimum-Weight Triangulation

Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomial- time heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so does the LP.Comment: To appear in SICOMP. Extended abstract appeared in SODA 201

A mixed-method empirical study of Function-as-a-Service software development in industrial practice

Function-as-a-Service (FaaS) describes cloud computing services that make infrastructure components transparent to application developers, thus falling in the larger group of “serverless” computing mod- els. When using FaaS offerings, such as AWS Lambda, developers provide atomic and short-running code for their functions, and FaaS providers execute and horizontally scale them on-demand. Currently, there is nosystematic research on how developers use serverless, what types of applications lend themselves to this model, or what architectural styles and practices FaaS-based applications are based on. We present results from a mixed-method study, combining interviews with practitioners who develop applications and systems that use FaaS, a systematic analysis of grey literature, and a Web-based survey. We find that successfully adopting FaaS requires a different mental model, where systems are primarily constructed by composing pre-existing services, with FaaS often acting as the “glue” that brings these services to- gether. Tooling availability and maturity, especially related to testing and deployment, remains a major difficulty. Further, we find that current FaaS systems lack systematic support for function reuse, and ab- stractions and programming models for building non-trivial FaaS applications are limited. We conclude with a discussion of implications for FaaS providers, software developers, and researchers

A polynomial bound for untangling geometric planar graphs

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while keeping at least n^\epsilon vertices fixed. We answer this question in the affirmative with \epsilon=1/4. The previous best known bound was \Omega((\log n / \log\log n)^{1/2}). We also consider untangling geometric trees. It is known that every n-vertex geometric tree can be untangled while keeping at least (n/3)^{1/2} vertices fixed, while the best upper bound was O(n\log n)^{2/3}. We answer a question of Spillner and Wolff [arXiv:0709.0170 2007] by closing this gap for untangling trees. In particular, we show that for infinitely many values of n, there is an n-vertex geometric tree that cannot be untangled while keeping more than 3(n^{1/2}-1) vertices fixed. Moreover, we improve the lower bound to (n/2)^{1/2}.Comment: 14 pages, 7 figure

Feasibility and efficacy of bypassing the right ventricle and pulmonary circulation to treat right ventricular failure: an experimental study

<p>Abstract</p> <p>Background</p> <p>Right ventricular failure (RVF) and -support is associated with poor results. We aimed for a new approach of right - sided assistance bypassing the right ventricle and pulmonary circulation in order to better decompress the right ventricle and optimize left ventricular filling.</p> <p>Methods</p> <p>From a microaxial pump (Abiomed), a low resistance oxygenator (Maquet and Novalung) and two cannulas (28 and 27 Fr) a system was set up and evaluated in an ovine model (n = 7). Connection with the heart was the right and left atrium. One hour the system was operated without RVF and turned of again. Then a RVF was induced and the course with the system running was evaluated. Complete hemodynamic monitoring was performed as well as echocardiography, flow measurement and blood gas analysis.</p> <p>Results</p> <p>The overall performance of the system was reliable. Without RVF no relevant changes of hemodynamics occurred; blood gases were supra normal. In RVF a cardiogenic shock developed (MAP 35 ± 13 mmHg, CO 1,1 ± 0,7 l/min). Immediately after starting the system the circulation normalized (significant increase of MAP to 85 ± 13 mmHg, of CO to 4,5 ± 1,9). Echocardiography also revealed right ventricular recovery. After stopping the system, RVF returned.</p> <p>Conclusions</p> <p>Bypassing the right ventricle and pulmonary circulation with an oxygenating assist device, which may offer the advantages of enhanced right ventricular decompression and augmented left atrial filling, is feasible and effective in the treatment of acute RVF. Long time experiments are needed.</p

Recognizing Treelike k-Dissimilarities

A k-dissimilarity D on a finite set X, |X| >= k, is a map from the set of size k subsets of X to the real numbers. Such maps naturally arise from edge-weighted trees T with leaf-set X: Given a subset Y of X of size k, D(Y) is defined to be the total length of the smallest subtree of T with leaf-set Y . In case k = 2, it is well-known that 2-dissimilarities arising in this way can be characterized by the so-called "4-point condition". However, in case k > 2 Pachter and Speyer recently posed the following question: Given an arbitrary k-dissimilarity, how do we test whether this map comes from a tree? In this paper, we provide an answer to this question, showing that for k >= 3 a k-dissimilarity on a set X arises from a tree if and only if its restriction to every 2k-element subset of X arises from some tree, and that 2k is the least possible subset size to ensure that this is the case. As a corollary, we show that there exists a polynomial-time algorithm to determine when a k-dissimilarity arises from a tree. We also give a 6-point condition for determining when a 3-dissimilarity arises from a tree, that is similar to the aforementioned 4-point condition.Comment: 18 pages, 4 figure